Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods Parallel Subdomain-based Preconditioner for Non-overlapping Domain Decomposition Methods
نویسندگان
چکیده
We present a new parallelizable preconditioner that is used as the local component for a two-level preconditioner similar to BPS. On 2D model problems that exhibit either high anisotropy or discontinuity, we demonstrate its attracting numerical behaviour and compare it to the regular BPS. Finally, to alleviate the construction cost of this new preconditioner, that requires the explicit computation of the local Schur complements, we propose a cheap alternative based, in the reported examples, on Incomplete Cholesky factorization, that reduces the computational cost but retains the attractive numerical features of the new preconditioner.
منابع مشابه
A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains
This paper considers an algebraic preconditioning algorithm for hyperbolicelliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of tr...
متن کاملDomain Decomposition Preconditioners for Linear–quadratic Elliptic Optimal Control Problems
We develop and analyze a class of overlapping domain decomposition (DD) preconditioners for linear-quadratic elliptic optimal control problems. Our preconditioners utilize the structure of the optimal control problems. Their execution requires the parallel solution of subdomain linear-quadratic elliptic optimal control problems, which are essentially smaller subdomain copies of the original pro...
متن کاملNon-Overlapping Domain Decom- position Methods
Non-overlapping domain decomposition methods are well-established and efficient algorithms for the solution of the large algebraic systems arising from finite element or finite difference discretizations of elliptic partial differential equations. They are well adapted to modern parallel computer architectures since they split the original problem into independent problems on the subdomains, wh...
متن کاملRobust Two-Level Lower-Order Preconditioners for a Higher-Order Stokes Discretization with Highly Discontinuous Viscosities
The main goal of this paper is to present new robust and scalable preconditioned conjugate gradient algorithms for solving Stokes equations with large viscosities jumps across subregion interfaces and discretized on non-structured meshes. The proposed algorithms do not require the construction of a coarse mesh and avoid expensive communications between coarse and fine levels. The algorithms bel...
متن کاملNewton-krylov-schwarz: an Implicit Solver for Cfd
Newton Krylov methods and Krylov Schwarz domain decomposition methods have begun to become established in computational uid dynamics CFD over the past decade The former employ a Krylov method inside of Newton s method in a Jacobian free manner through directional di erencing The latter employ an overlapping Schwarz domain decomposition to derive a preconditioner for the Krylov accelerator that ...
متن کامل